Analysis of Game Tree Search Algorithms Using Minimax Algorithm and Alpha-Beta Pruning

An important topic of research in computer systems is the optimization finding optimum course action based on different variables, such as environment's state, system's goal, etc. The building entire state search space, also known minimax algorithm, can result from any algorithm's attempt to find best feasible solution among all possibilities. recursive backtracking algorithm Minimax used select next a game strategy for two players. works well because it anticipates that your adversary will play well. However, tree's depth increases, we observe frequently investigates repetitive and unlikely situations. We'll take look at extension alpha-beta pruning, which prohibits us considering states won't be chosen. We examine number established techniques resolving two-player games, adversarial other machine learning-based techniques.